On irregularity strength of diamond network
نویسندگان
چکیده
منابع مشابه
On graph irregularity strength
An assignment of positive integer weights to the edges of a simple graph G is called irregular, if the weighted degrees of the vertices are all different. The irregularity strength, s(G), is the maximal weight, minimized over all irregular assignments. In this study, we show that s(G) c1 n / , for graphs with maximum degree n and minimum
متن کامل240 on Graphs of Irregularity Strength 2
We consider undirected graphs without loops or multiple edges. A weighting of a graph G is an assignment of a positive integer w( e) to each edge of G. For a vertex x€V(G), the (weighted) degree d(x) is the sum ofweights on the edges ofG incident to x. The irregularity strength s( G) of a graph G was introduced by Chartrand et al. in [1] a.s the minimum integer t such that G has a weighting wit...
متن کاملOn total vertex-irregularity strength of trees
A vertex-irregular total k-labelling λ : V (G)∪E(G) −→ {1, 2, ..., k} of a graph G is a labelling of vertices and edges of G in such a way that for any different vertices x and y, their weights wt(x) and wt(y) are distinct. The weight wt(x) of a vertex x is the sum of the label of x and the labels of all edges incident with x. The minimum k for which a graph G has a vertex-irregular total k-lab...
متن کاملIrregularity strength of digraphs
It is an elementary exercise to show that any non-trivial simple graph has two vertices with the same degree. This is not the case for digraphs and multigraphs. We consider generating irregular digraphs from arbitrary digraphs by adding multiple arcs. To this end, we define an irregular labeling of a digraph D to be an arc labeling of the digraph such that the ordered pairs of the sums of the i...
متن کاملOn total vertex irregularity strength of graphs
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths of graphs. In this paper we discuss how the addition of new edge affect the total vertex irregularity strength.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2018
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2017.10.003